Sequential scalar quantization of color images

نویسندگان

  • Raja Bala
  • Charles A. Bouman
  • Jan P. Allebach
چکیده

An efficient algorithm for color image quantization is proposed based on a new vector quantization technique that we call sequential scalar quantization. The scalar components of the 3-D color vector are individually quantized in a predetermined sequence. With this technique, the color palette is designed very efficiently, while pixel mapping is performed with no computation. To obtain an optimal allocation of quantization levels along each color coordinate, we appeal to the asymptotic quantization theory, where the number of quantization levels is assumed to be very large. We modify this theory to suit our application, where the number of quantization 1evels is typically small. To utilize the properties of the human visual system (HVS), the quantization is performed in a luminancechrominance color space. A luminance-chrominance weighting is introduced to account for the greater sensitivity of the HVS to luminance than to chrominance errors. A spatial activity measure is also incorporated to reflect the increased sensitivity of the HVS to quantization errors in smooth image regions. The algorithm yields highquality images and is significantly faster than existing quantization algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential scalar quantization of vectors: an analysis

Proposes an efficient vector quantization (VQ) technique called sequential scalar quantization (SSQ). The scalar components of the vector are individually quantized in a sequence, with the quantization of each component utilizing conditional information from the quantization of previous components. Unlike conventional independent scalar quantization (ISQ), SSQ has the ability to exploit interco...

متن کامل

Optimized universal cO pahttedesign for error diffusion

Currently, many low-cost computers can only simultaneously display a palette of 256 colors. However, this palette is usually selectable from a very large gamut of available colors. For many applications, this limited palette size imposes a significant constraint on the achievable image quality. We propose a method for designing an optimized universal color palette for use with halftoning method...

متن کامل

Optimized universal color palette design for error diffusion

Currently, many low cost computers can only simultaneously display a palette of 256 colors. However, this palette is usually selectable from a very large gamut of available colors. For many applications, this limited palette size imposes a significant constraint on the achievable image quality. In this paper, we propose a method for designing an optimized universal color palette for use with ha...

متن کامل

Image retrieval using color histograms generated by Gauss mixture vector quantization

Image retrieval based on color histograms requires quantization of a color space. Uniform scalar quantization of each color channel is a popular method for the reduction of histogram dimensionality. With this method, however, no spatial information among pixels is considered in constructing the histograms. Vector quantization (VQ) provides a simple and effective means for exploiting spatial inf...

متن کامل

Scalar chrominance and its applications in color representation

The paper deals with color image and video representation that consists of two components instead of three. The rst component is a luminance de ned in an usual way. The second component is a scalar chrominance obtained from two chrominance components, e.g. CR and CB or a and b . Conversion from two chrominance components to one scalar chrominance uses vector quantization of 2{dimensional vector...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Electronic Imaging

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1994